A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
A General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملSufficiency in Blackwell's theorem
If one information service is more informative than the other, then any agent values it more. In fact, the opposite implication (sufficiency) is also true, and this characterization is the celebrated Blackwell’s theorem. We present here a short proof of sufficiency. Actually, we show a stronger result: it is enough to check whether the value of the service is greater than the value of the other...
متن کاملStokes' Theorem for Nonsmooth Chains
Much of the vast literature on the integral during the last two centuries concerns extending the class of integrable functions. In contrast, our viewpoint is akin to that taken by Hassler Whitney [Geometric integration theory, Princeton Univ. Press, Princeton, NJ, 1957] and by geometric measure theorists because we extend the class of integrable domains. Let oi be an «-form defined on Rm . We s...
متن کاملTrajectory Optimization for a Multistage Launch Vehicle Using Nonlinear Programming
This work is an example of application of nonlinear programming to a problem of three-dimensional trajectory optimization for multistage launch vehicles for geostationary orbit missions. The main objective is to minimize fuel consumption or equivalently to maximize the payload. The launch vehicle considered here, Europa-II, consists of 5 thrust phases and 2 coast phases. Major parameters of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.2307/1999429